Monochromatic paths on edge colored digraphs and state splittings
نویسندگان
چکیده
We look at the behavior under state splitting of distinct kinds of properties regarding monochromatic paths on edge colored digraphs. These are absorbance and independence as well as the existence of kernels, semikernels, quasikernels and Grundy functions, all of them defined in terms of monochromatic paths.
منابع مشابه
The Edge-Recoloring Cost of Paths and Cycles in Edge-Colored Graphs and Digraphs
We introduce a number of problems regarding edge-color modifications in edge-colored graphs and digraphs. Consider a property π, a c-edge-colored graph G not satisfying π, and an edge-recoloring cost matrix R = [rij ]c×c where rij ≥ 0 denotes the cost of changing color i of edge e to color j. Basically, in this kind of problem the idea is to change the colors of one or more edges of G in order ...
متن کاملKernels and some operations in edge-coloured digraphs
Let D be an edge-coloured digraph, V (D) will denote the set of vertices of D; a set N ⊆ V (D) is said to be a kernel by monochromatic paths of D if it satisfies the following two conditions: For every pair of different vertices u, v ∈ N there is no monochromatic directed path between them and; for every vertex x ∈ V (D) − N there is a vertex y ∈ N such that there is an xy -monochromatic direct...
متن کاملKernels by monochromatic paths in digraphs with covering number 2
We call the digraph D an m-colored digraph if the arcs of D are colored with m colors. A subdigraph H of D is called monochromatic if all of its arcs are colored alike. A set N ⊆ V (D) is said to be a kernel by monochromatic paths if it satisfies the following two conditions: (i) for every pair of different vertices u, v ∈ N there is no monochromatic directed path between them and; (ii) for eve...
متن کاملDecompositions of edge-colored infinite complete graphs into monochromatic paths
For r ∈ N\{0} an r-edge coloring of a graph or hypergraph G = (V,E) is a map c : E → {0, . . . , r−1}. Extending results of Rado and answering questions of Rado, Gyárfás and Sárközy we prove that • every r-edge colored complete k-uniform hypergraph on N can be partitioned into r monochromatic tight paths with distinct colors (a tight path in a kuniform hypergraph is a sequence of distinct verti...
متن کاملMonochromatic s-t Paths in Edge-Colored Graphs
In this paper we consider an approach to solve the problem of finding monochromatic s-t paths in edge-colored graphs. This approach is based on constructing logical models for the problem. Algorithmic problems extensively investigated in bioinformatics (see e.g. [1] – [3]). In particular, there are a number of applications of different problems of finding paths. In this paper we consider the pr...
متن کامل